翻訳と辞書
Words near each other
・ "O" Is for Outlaw
・ "O"-Jung.Ban.Hap.
・ "Ode-to-Napoleon" hexachord
・ "Oh Yeah!" Live
・ "Our Contemporary" regional art exhibition (Leningrad, 1975)
・ "P" Is for Peril
・ "Pimpernel" Smith
・ "Polish death camp" controversy
・ "Pro knigi" ("About books")
・ "Prosopa" Greek Television Awards
・ "Pussy Cats" Starring the Walkmen
・ "Q" Is for Quarry
・ "R" Is for Ricochet
・ "R" The King (2016 film)
・ "Rags" Ragland
・ ! (album)
・ ! (disambiguation)
・ !!
・ !!!
・ !!! (album)
・ !!Destroy-Oh-Boy!!
・ !Action Pact!
・ !Arriba! La Pachanga
・ !Hero
・ !Hero (album)
・ !Kung language
・ !Oka Tokat
・ !PAUS3
・ !T.O.O.H.!
・ !Women Art Revolution


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

positional game : ウィキペディア英語版
positional game

In the mathematical study of combinatorial games, positional games are games described by a finite set of positions in which a move consists of claiming a previously-unclaimed position. Well-known games that fall into this class include Tic-tac-toe, Hex, and the Shannon switching game.〔J. Beck: ''Combinatorial Games: Tic-Tac-Toe Theory'', Cambridge University Press, 2008.〕 〔D. Hefetz, M. Krivelevich, M. Stojaković and T. Szabó: ''Positional Games'', Oberwolfach Seminars, Vol. 44, Birkhäuser Basel, 2014.〕
==Definition==
A positional game may be described by a pair (X,\mathcal) where X is a finite set of positions and \mathcal is a family of subsets of X; X is called the board and the sets in F are called winning sets. The game is played by two players who alternately claim unclaimed elements of the board, until all the elements are claimed. The winner may be determined in several ways:
*In a strong positional game, the first player to claim all of the elements of a winning set wins. If the game ends with all elements of the board claimed, but no player has claimed all elements of a winning set, it is a draw. Tic-tac-toe is an example of a strong positional game; in it, the winning sets are all sets of positions that include a subset of three positions in a row.
*In a maker-breaker game, the two players are called Maker and Breaker. Maker wins by claiming all elements of a winning set. If the game ends with all elements of the board claimed, and Maker has not yet won, then Breaker wins. Draws are not possible. In the Shannon switching game, an example of a game of this type, Maker's goal is to claim a set that includes all of the edges in a path between two designated nodes of a graph, and Breaker's goal is to prevent Maker from forming such a path.
*In an avoider-enforcer game, the players are called Avoider and Enforcer. Enforcer wins if Avoider ever claims all of the elements of a winning set. If the game ends with all elements of the board claimed, and Avoider has not claimed a winning set, then Avoider wins. As in maker-breaker games, a draw is not possible.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「positional game」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.